package com.string;

/**04-19
 * 最长公共子序列
 */
public class LongestCommonSubsequence {
    /*
    动态规划
     */
    public int longestCommonSubsequence(String text1, String text2) {
        int m=text1.length(),n=text2.length();
        int[][] f=new int[m+1][n+1];
        for (int i = 1; i <=n; i++) {
            for (int j = 1; j <=m ; j++) {
                if (text1.charAt(i-1)==text2.charAt(j-1)){
                    f[i][j]=f[i-1][j-1]+1;
                }else {
                    f[i][j]=Math.max(f[i-1][j],f[i][j-1]);
                }
            }
        }
        return f[m][n];
    }
}
